据我们所知,所有用于前列腺癌的计算机辅助检测和诊断(CAD)系统(PCA)检测仅考虑双参数磁共振成像(BP-MRI),包括T2W和ADC序列,同时排除了4D灌注序列,该序列排除了4D灌注序列,该序列不包括4D灌注序列,该序列不包括T2W和ADC序列。但是,是此诊断任务的标准临床方案的一部分。在本文中,我们质疑将灌注成像中信息整合到深神经体系结构中的策略。为此,我们评估了几种方法来在U-NET等U-NET中编码灌注信息,还考虑了早期融合策略和中期融合策略。我们将多参数MRI(MP-MRI)模型的性能与基于219 MP-MRI考试的私有数据集的基线BP-MRI模型进行了比较。从动态对比度增强的MR检查得出的灌注图显示出对PCA病变的分割和分级性能的积极影响,尤其是对应于洗涤曲线最大斜率以及TMAX灌注图的3D MR体积。无论融合策略如何中型融合策略,也与最新技术相比,还达到了竞争性的科恩的喀巴评分。
translated by 谷歌翻译
Polypharmacy, most often defined as the simultaneous consumption of five or more drugs at once, is a prevalent phenomenon in the older population. Some of these polypharmacies, deemed inappropriate, may be associated with adverse health outcomes such as death or hospitalization. Considering the combinatorial nature of the problem as well as the size of claims database and the cost to compute an exact association measure for a given drug combination, it is impossible to investigate every possible combination of drugs. Therefore, we propose to optimize the search for potentially inappropriate polypharmacies (PIPs). To this end, we propose the OptimNeuralTS strategy, based on Neural Thompson Sampling and differential evolution, to efficiently mine claims datasets and build a predictive model of the association between drug combinations and health outcomes. We benchmark our method using two datasets generated by an internally developed simulator of polypharmacy data containing 500 drugs and 100 000 distinct combinations. Empirically, our method can detect up to 33\% of PIPs while maintaining an average precision score of 99\% using 10 000 time steps.
translated by 谷歌翻译
The most useful data mining primitives are distance measures. With an effective distance measure, it is possible to perform classification, clustering, anomaly detection, segmentation, etc. For single-event time series Euclidean Distance and Dynamic Time Warping distance are known to be extremely effective. However, for time series containing cyclical behaviors, the semantic meaningfulness of such comparisons is less clear. For example, on two separate days the telemetry from an athlete workout routine might be very similar. The second day may change the order in of performing push-ups and squats, adding repetitions of pull-ups, or completely omitting dumbbell curls. Any of these minor changes would defeat existing time series distance measures. Some bag-of-features methods have been proposed to address this problem, but we argue that in many cases, similarity is intimately tied to the shapes of subsequences within these longer time series. In such cases, summative features will lack discrimination ability. In this work we introduce PRCIS, which stands for Pattern Representation Comparison in Series. PRCIS is a distance measure for long time series, which exploits recent progress in our ability to summarize time series with dictionaries. We will demonstrate the utility of our ideas on diverse tasks and datasets.
translated by 谷歌翻译
Like fingerprints, cortical folding patterns are unique to each brain even though they follow a general species-specific organization. Some folding patterns have been linked with neurodevelopmental disorders. However, due to the high inter-individual variability, the identification of rare folding patterns that could become biomarkers remains a very complex task. This paper proposes a novel unsupervised deep learning approach to identify rare folding patterns and assess the degree of deviations that can be detected. To this end, we preprocess the brain MR images to focus the learning on the folding morphology and train a beta-VAE to model the inter-individual variability of the folding. We compare the detection power of the latent space and of the reconstruction errors, using synthetic benchmarks and one actual rare configuration related to the central sulcus. Finally, we assess the generalization of our method on a developmental anomaly located in another region. Our results suggest that this method enables encoding relevant folding characteristics that can be enlightened and better interpreted based on the generative power of the beta-VAE. The latent space and the reconstruction errors bring complementary information and enable the identification of rare patterns of different nature. This method generalizes well to a different region on another dataset. Code is available at https://github.com/neurospin-projects/2022_lguillon_rare_folding_detection.
translated by 谷歌翻译
解决了与人类偏好的安全一致性以及学习效率之类的各种目的,越来越多的强化学习研究集中在依赖整个收益分配的风险功能上。关于\ emph {Oplicy风险评估}(OPRA)的最新工作,针对上下文匪徒引入了目标策略的收益率以及有限样本保证的一致估计量,并保证了(并同时保留所有风险)。在本文中,我们将OPRA提升到马尔可夫决策过程(MDPS),其中重要性采样(IS)CDF估计量由于有效样本量较小而遭受较长轨迹的较大差异。为了减轻这些问题,我们合并了基于模型的估计,以开发MDPS回报的CDF的第一个双重鲁棒(DR)估计器。该估计器的差异明显较小,并且在指定模型时,可以实现Cramer-Rao方差下限。此外,对于许多风险功能,下游估计值同时享有较低的偏差和较低的差异。此外,我们得出了非政策CDF和风险估计的第一个Minimax下限,这与我们的误差界限到恒定因子。最后,我们在几种不同的环境上实验表明了DR CDF估计的精度。
translated by 谷歌翻译
我们介绍了本地重新考虑的任务,该任务通过打开和关闭图像中可见的光源来改变场景的照片。这项新任务与传统的图像重新确定问题不同,因为它引入了检测光源并推断出从它们中散发出的光模式的挑战。我们提出了一种用于本地重新考虑的方法,该方法通过使用另一个模型的合成生成的图像对来训练模型,而无需监督任何新型图像数据集。具体而言,我们从样式空间操纵的gan中收集了配对的训练图像;然后,我们使用这些图像来训练有条件的图像到图像模型。为了基于本地重新测试,我们介绍了Lonoff,这是一个在室内空间中拍摄的306张精确对齐图像的集合,其中灯的不同组合打开了。我们表明,我们的方法显着优于基于GAN倒置的基线方法。最后,我们演示了分别控制不同光源的方法的扩展。我们邀请社区解决这项新的当地重新任务。
translated by 谷歌翻译
标准均匀收敛导致在假设类别上预期损失的概括差距。对风险敏感学习的出现需要超出预期损失分布的功能的概括保证。虽然先前的工作专门从事特定功能的均匀收敛,但我们的工作为一般的H \'较旧风险功能提供了统一的收敛,累积分配功能(CDF)的亲密关系(CDF)需要接近风险。我们建立了第一个统一的融合估计损失分布的CDF的结果,可以保证在所有H \“较旧的风险功能和所有假设上)同时保持。因此,我们获得了实现经验风险最小化的许可,我们开发了基于梯度的实用方法,以最大程度地减少失真风险(广泛研究的H \'H \'较旧风险涵盖了光谱风险,包括平均值,有条件价值,风险的有条件价值,累积前景理论风险和累积前景理论风险,以及其他)并提供融合保证。在实验中,我们证明了学习程序的功效,这是在均匀收敛结果和具有深层网络的高维度的设置中。
translated by 谷歌翻译
本文调查了美国境内自动驾驶汽车进行的最后一英里交付的最终用户接受。总共向296名参与者介绍了有关该技术的信息,然后要求填写有关他们的看法的调查表,以评估他们有关接受的行为意图。采用了部分最小二乘风味(PLS-SEM)的结构方程模型来分析收集的数据。结果表明,该技术的有用性在最终用户接受决策中起着最大作用,随后是他人的影响,然后通过与技术互动而获得的享受。此外,对使用自动递送工具进行最后一英里交付的风险的看法导致接受程度减少。但是,大多数参与者并未认为使用该技术具有风险。本文总结了我们的发现对各个利益相关者的影响,并提出了这一研究领域的下一步。
translated by 谷歌翻译
离线增强学习(RL)的样本效率保证通常依赖于对功能类别(例如Bellman-Completeness)和数据覆盖范围(例如,全政策浓缩性)的强有力的假设。尽管最近在放松这些假设方面做出了努力,但现有作品只能放松这两个因素之一,从而使另一个因素的强烈假设完好无损。作为一个重要的开放问题,我们是否可以实现对这两个因素的假设较弱的样本效率离线RL?在本文中,我们以积极的态度回答了这个问题。我们基于MDP的原始偶对偶进行分析了一种简单的算法,其中双重变量(打折占用)是使用密度比函数对离线数据进行建模的。通过适当的正则化,我们表明该算法仅在可变性和单极浓缩性下具有多项式样品的复杂性。我们还基于不同的假设提供了替代分析,以阐明离线RL原始二算法的性质。
translated by 谷歌翻译
适当的统计建模包含域理论关于概念如何相关的概念和如何测量数据的细节。但是,数据分析师目前缺乏以综合方式录制和推理关于域假设,数据收集和建模选择的工具支持,导致可能损害科学有效性的错误。例如,广义线性混合效果模型(GLMMS)有助于回答复杂的研究问题,但省略随机效应损害结果的易用性。为了解决这种需求,我们提出了Tisane,一个混合主动系统,用于创作具有和没有混合效应的广义线性模型。 Tisane介绍了一种研究设计规范语言,用于表达和询问变量之间的关系。 Tisane贡献了一个交互式编译过程,表示图表中的关系,Infers候选统计模型,并询问后续问题来消除用户查询来构造有效模型。在与三位研究人员的研究中,我们发现Tisane有助于他们专注于他们的目标和假设,同时避免过去的错误。
translated by 谷歌翻译